Computer Chinese Chess

نویسندگان

  • Shi-Jim Yen
  • Jr-Chang Chen
  • Tai-Ning Yang
  • Shun-chin Hsu
چکیده

This article describes the current state of computer Chinese chess (Xiang Qi). For two reasons, Chinese-chess programming is important in the field of Artificial Intelligence. First, Chinese chess is one of the most popular and oldest board games worldwide; currently the strength of a Chinesechess program can be compared to that of human players. Second, the complexity of Chinese chess is between that of chess and Go. We assume that after DEEP BLUE’s victory over Kasparov in 1997, Chinese chess will be the next popular chess-like board game at which a program will defeat a human top player. In the article we introduce some techniques for developing Chinese-chess programs. In the Computer Olympiads of 2001 and 2002, the programs ELP and SHIGA were the top Chinese-chess programs. Although these two programs roughly have the same strength, they were developed following completely different techniques, as described in the article. The improvements of the best Chinese-chess programs over the last twenty years suggest that a human top player will be defeated before 2010.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Abstracting Knowledge from Annotated Chinese-Chess Game Records

ing Knowledge from Annotated Chinese-Chess Game Records Bo-Nian Chen , Pangfang Liu, Shun-Chin Hsu, and Tsan-sheng Hsu 1 Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan {r92025,pangfeng}@csie.ntu.edu.tw 2 Department of Information Management, Chang Jung Christian University, Tainan, Taiwan [email protected] 3 Institute of Information Sc...

متن کامل

Chinese Dark Chess

Chinese dark chess is a popular and easy-to-learn game in Asia. The characteristic of possible revealing of unknown pieces makes it different from Chinese chess or Western chess. Players with luck may win a game by chance. Thus, there is a probabilistic behavior that a player has to consider. Computer Chinese dark chess problems can be divided into three phases: 1) the opening game, 2) the midd...

متن کامل

Selective Extensions in Game-Tree Search †

Although most of today’s chess playing programs still adopt a brute-force approach in their search region, much has been done on search extensions to make the effort spent more worthwhile. In this paper, we discuss some successful search extension heuristics in the domain of Chinese Chess, a game that bears much resemblance to chess. We restrict our experiments to the following: knowledge searc...

متن کامل

From Chinese Room to Human Window

The debate in philosophy and cognitive science about the Chinese Room Argument has focused on whether it shows that machines can have minds. We present a quantitative argument which shows that Searle’s thought experiment is not relevant to Turing’s Test for intelligence. Instead, we consider a narrower form of Turing’s Test, one that is restricted to the playing of a chess endgame, in which the...

متن کامل

Conflict Resolution of Chinese Chess Endgame Knowledge Base

Endgame heuristics are often incorperated as part of the evaluation function used in Chinese chess programs. In our program, Contemplation, we have proposed an automatic strategy to construct a large set of endgame heuristics. In this paper, we propose a conflict resolution strategy to eliminate the conflicts among the constructed heuristic database, which is called endgame knowledge base. In o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • ICGA Journal

دوره 27  شماره 

صفحات  -

تاریخ انتشار 2004